Enumerations of lattice animals and trees

نویسنده

  • Iwan Jensen
چکیده

We have developed an improved algorithm that allows us to enumerate the number of site animals on the square lattice up to size 46. We also calculate the number of lattice trees up to size 44 and the radius of gyration of both lattice animals and trees up to size 42. Analysis of the resulting series yields an improved estimate, λ = 4.062570(8), for the growth constant of lattice animals, and, λ0 = 3.795254(8), for the growth constant of trees, and confirms to a very high degree of certainty that both the animal and tree generating functions have a logarithmic divergence. Analysis of the radius of gyration series yields the estimate, ν = 0.64115(5), for the size exponent.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

More Patterns in Trees: Up and Down, Young and Old, Odd and Even

We apply the tree-pattern enumeration formulæ of [7], and a new extension thereof, to some recent enumerations of distributions of leaves in ordered trees [4] and in bicolored ordered trees [5], and of distributions of certain subpaths in Dyck lattice paths [22]. the bridge guard’s bucket upside-down to dry. . . fresh leaves —Issa (1818)

متن کامل

Critical two-point functions and the lace expansion for spread-out high-dimensional percolation and related models

We consider spread-out models of self-avoiding walk, bond percolation, lattice trees and bond lattice animals on Zd, having long finite-range connections, above their upper critical dimensions d = 4 (self-avoiding walk), d = 6 (percolation) and d = 8 (trees and animals). The two-point functions for these models are respectively the generating function for selfavoiding walks from the origin to x...

متن کامل

Decay of Correlations in Nearest - Neighbor Self - Avoiding Walk , Percolation , Lattice Trees and Animals

We consider nearest-neighbor self-avoiding walk, bond percolation, lattice trees, and bond lattice animals on Z. The two-point functions of these models are respectively the generating function for self-avoiding walks from the origin to x ∈ Z, the probability of a connection from the origin to x, and the generating functions for lattice trees or lattice animals containing the origin and x. Usin...

متن کامل

Decay of Correlations in Nearest-Neighbour Self-Avoiding Walk, Percolation, Lattice Trees and Animals

We consider nearest-neighbour self-avoiding walk, bond percolation, lattice trees, and bond lattice animals on Z. The two-point functions of these models are respectively the generating function for self-avoiding walks from the origin to x ∈ Z, the probability of a connection from the origin to x, and the generating functions for lattice trees or lattice animals containing the origin and x. Usi...

متن کامل

Critical Two-point Functions and the Lace Expansion for Spread-out High-dimensional Percolation and Related Models by Takashi Hara,1 Remco

We consider spread-out models of self-avoiding walk, bond percolation, lattice trees and bond lattice animals on Zd , having long finite-range connections, above their upper critical dimensions d = 4 (self-avoiding walk), d = 6 (percolation) and d = 8 (trees and animals). The two-point functions for these models are respectively the generating function for selfavoiding walks from the origin to ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2001